OmniMerge: A Systematic Approach to Constrained Conformational Search
نویسندگان
چکیده
OmniMerge performs a systematic search to enumerate all conformations of a molecule (at a given level of torsionangle resolution) that satisfy a set of local geometric constraints. Constraints would typically come from NMR experiments, but applications such as docking or homology modeling could also give rise to similar constraints. The molecule to be searched is partitioned into small subchains so that the set of possible conformations for the whole molecule may be constructed by merging the feasible conformations for the subchain parts. However, instead of using a binary tree for straightforward divide-and-conquer, OmniMerge defines a subproblem for every possible subchain of the molecule. Searching every subchain provides a counter-intuitive advantage: with every possible subdivision available for merging, one may choose the most favorable merge for each subchain, particularly for the bottleneck chain(s). Improving the bottleneck step may therefore cause the whole search to be completed more quickly. Finally, to discard infeasible conformations more rapidly, OmniMerge filters the solution set of each subchain based on compatibility with the solutions sets of all overlapping subchains. These two innovations—choosing the most favorable merges and enforcing consistency between overlapping subchains—yield significant improvements in run time. By determining the extent of structural variability permitted by a set of constraints, OmniMerge offers the potential to aid error analysis and improve confidence for NMR results on peptides and moderate-sized molecules.
منابع مشابه
The Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملA Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS II. SOUNDS OF SILENCE: A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA HARMONY SEARCH METAHEURISTIC
In this paper, we present a new idea for robust project scheduling combined with a cost-oriented uncertainty investigation. The result of the new approach is a makespan minimal robust proactive schedule, which is immune against the uncertainties in the activity durations and which can be evaluated from a cost-oriented point of view on the set of the uncertain-but-bounded duration and cost param...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002